An algorithm for fragment-aware virtual network reconfiguration
نویسندگان
چکیده
منابع مشابه
An algorithm for dynamic reconfiguration of a multicomputer network
The dynamic reconfiguration of the interconnection network is an advanced feature of some multicomputers to reduce the communication overhead. In this paper we present an algorithm for the dynamic reconfiguration of the network. Reconfiguration is limited, preserving the original topology. Long distance message passing is minimized by positioning communication partners close to each other. That...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملOptimal Reconfiguration of Distribution Network for Power Loss Reduction and Reliability Improvement Using Bat Algorithm
In power systems, reconfiguration is one of the simplest and most low-cost methods to reach many goals such as self-healing, reliability improvement, and power loss reduction, without including any additional components. Regarding the expansion of distribution networks, communications become more complicate and the number of parameters increases, which makes the reconfiguration problem infeasib...
متن کاملEnergy-aware node and link reconfiguration for virtualized network environments
Energy consumption in information and communications technology (ICT) accounts for a large portion of the total energy consumed in industrial countries, which is rapidly increasing. Virtualized network environments (VNEs) have recently emerged as a solution in this technology to address the challenges of future Internet. VNEs also play a fundamental role toward virtualizing data centers. Conseq...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0207705